Optimal buffer size and dynamic rate control for a queueing system
نویسندگان
چکیده
We address a rate control problem associated with a single server Markovian queueing system with customer abandonment in heavy traffic. The controller can choose a buffer size for the queuing system and also can dynamically control the service rate (equivalently the arrival rate) depending on the current state of the system. An infinite horizon cost minimization problem is considered here. The cost function includes a penalty for each rejected customer, a control cost related to the adjustment of the service rate and a penalty for each abandoning customer. We obtain an explicit optimal strategy for the limiting diffusion control problem (the Brownian control problem or BCP) which consists of a threshold-type optimal rejection process and a feedback-type optimal drift control. This solution is then used to construct an asymptotically optimal control policy, i.e. an optimal buffer size and an optimal service rate for the queueing system in heavy traffic. The properties of generalized regulator maps and weak convergence techniques are employed to prove the asymptotic optimality of this policy. In addition, we identify the parameter regimes where the infinite buffer size is optimal. Abbreviated Title: Controlled queues with reneging.
منابع مشابه
Optimal buffer size and dynamic rate control for a queueing
We address a rate control problem associated with a single server Markovian queueing system with customer abandonment in heavy traffic. The controller can choose a buffer size for the queuing network and also can dynamically control the service rate (equivalently the arrival rate) depending on the current state of the network. An infinite horizon cost minimization problem is considered here. Th...
متن کاملDiscrete Time Analysis of Multi-Server Queueing System with Multiple Working Vacations and Reneging of Customers
This paper analyzes a discrete-time $Geo/Geo/c$ queueing system with multiple working vacations and reneging in which customers arrive according to a geometric process. As soon as the system gets empty, the servers go to a working vacations all together. The service times during regular busy period, working vacation period and vacation times are assumed to be geometrically distributed. Customer...
متن کاملOptimal buffer size for a stochastic processing network in heavy traffic
We consider a one dimensional stochastic control problem that arises from queueing network applications. The state process corresponding to the queue-length is given by a stochastic differential equation which reflects at the origin. The controller can choose the drift coefficient which represents the service rate and the buffer size b > 0. When the queue-length reaches b, the new customers are...
متن کاملPreprint #06-14 OPTIMAL BUFFER SIZE FOR A STOCHASTIC PROCESSING NETWORK WITH A DRIFT. by ARKA P. GHOSH AND ANANDA P. WEERASINGHE
We consider a one dimensional stochastic control problem that arises from queueing network applications. The state process corresponding to the queue-length is given by a stochastic differential equation which reflects at the origin. The controller can choose the drift coefficient which represents the service rate and the buffer size b > 0. When the queue-length reaches b, the new customers are...
متن کاملA Queueing-Inventory System with Repair Center for Defective Items and One-for-One Ordering Policy
In this paper we consider a system consisting of a supplier with a single processing unit, a repair center, and a retailer with Poisson demand. We assume that the retailer applies one-for-one ordering policy with backorders for his inventory control. The retailer’s orders form a queue in the supplier processing unit. We also assume that a certain fraction of the products produced by the supplie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010